package acwing.每日一题;/**
 * @author： li
 * @date： 2022-03-24 10:38
 * @version 1.0
 */
import java.util.*;
public class 三角形 {
    static class point{
        private int x;
        private int y;
        public point(int x, int y) {
            this.x = x;
            this.y = y;
        }
        public point() {
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        point[] points = new point[105];
        for(int i=0;i<n;i++){
            points[i] = new point(sc.nextInt(),sc.nextInt());
        }
//        for(int i=0;i<n;i++)
//            System.out.print(points[i].x+" "+points[i].y);
        int ans=0;
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++){
                for(int k=0;k<n;k++){
                    if(i==j||i==k||j==k) continue;
                    if((points[i].x==points[j].x)&&(points[j].y==points[k].y))
                    ans =Math.max(ans,Math.abs(points[i].y-points[j].y)*Math.abs(points[i].x-points[k].x));
                }
            }
        System.out.println(ans);
    }
}
